Acceleration of the Finite-Element Gaussian Belief Propagation Solver Using Minimum Residual Techniques
نویسندگان
چکیده
منابع مشابه
Parallel finite element technique using Gaussian belief propagation
The computational efficiency of Finite Element Methods (FEMs) on parallel architectures is severely limited by conventional sparse iterative solvers. Conventional solvers are based on a sequence of global algebraic operations that limits their parallel efficiency. Traditionally, sophisticated programming techniques tailored to specific CPU architectures are used to improve the poor performance ...
متن کاملbuckling of viscoelastic composite plates using the finite strip method
در سال های اخیر، تقاضای استفاده از تئوری خطی ویسکوالاستیسیته بیشتر شده است. با افزایش استفاده از کامپوزیت های پیشرفته در صنایع هوایی و همچنین استفاده روزافزون از مواد پلیمری، اهمیت روش های دقیق طراحی و تحلیل چنین ساختارهایی بیشتر شده است. این مواد جدید از خودشان رفتارهای مکانیکی ارائه می دهند که با تئوری های الاستیسیته و ویسکوزیته، نمی توان آن ها را توصیف کرد. این مواد، خواص ویسکوالاستیک دارند....
Gaussian Process Belief Propagation
The framework of graphical models is a cornerstone of applied Statistics, allowing for an intuitive graphical specification of the main features of a model, and providing a basis for general Bayesian inference computations though belief propagation (BP). In the latter, messages are passed between marginal beliefs of groups of variables. In parametric models, where all variables are of fixed fin...
متن کاملHardware Acceleration for Boolean Satisfiability Solver by Applying Belief Propagation Algorithm
Boolean satisfiability (SAT) has an extensive application domain in computer science, especially in electronic design automation applications. Circuit synthesis, optimization, and verification problems can be solved by transforming original problems to SAT problems. However, the SAT problem is known as an NP-complete problem, which means there is no efficient method to solve SAT problems. There...
متن کاملBelief-Propagation Decoding of Lattices Using Gaussian Mixtures
A belief-propagation decoder for low-density lattice codes is given which represents messages explicitly as a mixture of Gaussians functions. The key component is an algorithm for approximating a mixture of several Gaussians with another mixture with a smaller number of Gaussians. This Gaussian mixture reduction algorithm iteratively reduces the number of Gaussians by minimizing the distance be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Magnetics
سال: 2016
ISSN: 0018-9464,1941-0069
DOI: 10.1109/tmag.2015.2487683